Uniqueness of Normal Forms for Shallow Term Rewrite Systems
نویسندگان
چکیده
منابع مشابه
Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems
Uniqueness of normal forms (UN=) is an important property of term rewrite systems. UN= is decidable for ground (i.e., variable-free) systems and undecidable in general. Recently it was shown to be decidable for linear, shallow systems. We generalize this previous result and show that this property is decidable for shallow rewrite systems, in contrast to confluence, reachability and other proper...
متن کاملUnique Normal Forms and Confluence of Rewrite Systems: Persistence
Programming language interpreters, proving theorems of the form A = 2?, abstract data types, and program optimization can all be rep resented by a finite set of rules called a rewrite system. In this paper, we study two funda mental concepts, uniqueness of normal forms and confluence, for nonlinear systems in the ab sence of termination. This is a difficult topic with only a few results so f...
متن کاملUniqueness of Normal Forms and Modularity of Confluence for Term Rewriting Systems
Programming language interpreters, proving theorems of the form A = B, abstract data types and program optimization can all be represented by a finite set of rules called a rewrite system. In this paper, we study two fundamental concepts, uniqueness of normal forms and confluence, for nonlinear systems in the absence of termination. This is a difficult topic with only a few results so far. Thro...
متن کاملConfluence of Shallow Right-Linear Rewrite Systems
We show that confluence of shallow and right-linear term rewriting systems is decidable. This class of rewriting system is expressive enough to include nontrivial nonground rules such as commutativity, identity, and idempotence. Our proof uses the fact that this class of rewrite systems is known to be regularity-preserving, which implies that its reachability and joinability problems are decida...
متن کاملA complete rewrite system and normal forms for ( S ) reg
The (.)reg construction was introduced in order to make an arbitrary semigroup S divide a regular semigroup (S)reg which shares some important properties with S (e.g., finiteness, subgroups, torsion bounds, J-order structure). We show that (S)reg can be described by a rather simple complete string rewrite system, as a consequence of which we obtain a new proof of the normal form theorem for (S)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2017
ISSN: 1529-3785,1557-945X
DOI: 10.1145/3060144